An Efficient Deadlock Detection and Resolution Algorithm for Generalized Deadlocks
نویسندگان
چکیده
In existing deadlock detection and resolution algorithms, only a few of them can handle deadlocks in generalized request models. Most of these algorithms diffuse probes and collect dependency information in the replies. In this paper, we propose an efficient algorithm to detect and resolve generalized deadlocks. In this algorithm, replies are sent after a process has received all the messages from its predecessors. This mechanism reduces both the quantity and total size of the messages. The message number of our proposed algorithm is O(e+n). And the experiment shows that our algorithm has better performance in concurrent executions.
منابع مشابه
Efficient algorithms for detection and resolution of distributed deadlocks
We present a simple and efficient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-€or graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an “image” of the WF...
متن کاملA Revised Algorithms for Deadlock Detection and Resolution in Mobile Agent Systems
A study on Deadlock detection is being done for many years. Not much work has been done on Deadlock resolution. Wait –for model approach followed to avoid deadlocks offers incorrectness to many algorithms after deadlocks have been resolved. In this paper, a theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resol...
متن کاملOn-Line Detection and Resolution of Communication Deadlocks
W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i .e . , simultaneously detects and resolves deadlock as communication requests are made, at no additional message t r a f i c overhead, and with bounded delay between the occurrence and detection of a deadlock. This i s achieved via a novel technique for detecting knots, which suf ice for the exi...
متن کاملA Hybrid Algorithm for Fast Detection and Resolution of Generalized Deadlocks in Distributed Systems
In the literature only a handful of studies have been performed on the distributed deadlock problem in the generalized request model. Most of those algorithms use either the diffusing computation technique or have the initiator collect all the dependency information among processes. This paper proposes an algorithm which incorporates these two methods with the following properties: first, it re...
متن کاملA One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
Replicated databases that use quorum-consensus algorithms to perform majority voting are prone to deadlocks. Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. The algorithm performs reduction of a distributed waitfor-graph (...
متن کامل